An optimal stopping problem with a reward constraint

نویسندگان

  • Jérôme Detemple
  • Weidong Tian
  • Jie Xiong
چکیده

This article studies an optimal stopping problem with an endogenous constraint on the set of admissible stopping times. The constraint stipulates that continuation is permitted, at any given date t, only if the endogenous reward achieved exceeds a prespecified threshold. Characterizations of the value function and the optimal stopping time are presented. An application to the pricing of corporate claims, when the capital structure of the firm includes equity-trigger debt, is carried out. JEL Classification: G11.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Optimal Reward Function of the Continuous Time Multiarmed Bandit Problem

The optimal reward function associated with the so-called "multiarmed bandit problem" for general Markov-Feller processes is considered. It is shown that this optimal reward function has a simple expression (product form) in terms of individual stopping problems, without any smoothness properties of the optimal reward function neither for the global problem nor for the individual stopping probl...

متن کامل

Discretionary Stopping of One-dimensional Itô Diffusions with a Staircase Reward Function

We consider the problem of optimally stopping a general one-dimensional Itô diffusion X. In particular, we solve the problem that aims at maximising the performance criterion Ex [exp(− ∫ τ 0 r(Xs) ds)f (Xτ )] over all stopping times τ , where the reward function f can take only a finite number of values and has a ‘staircase’ form. This problem is partly motivated by applications to financial as...

متن کامل

Construction of the Value Function and Optimal Rules in Optimal Stopping of One-dimensional Diffusions

A new approach to the solution of optimal stopping problems for one-dimensional diffusions is developed. It arises by imbedding the stochastic problem in a linear programming problem over a space of measures. Optimizing over a smaller class of stopping rules provides a lower bound on the value of the original problem. Then the weak duality of a restricted form of the dual linear program provide...

متن کامل

On optimal stopping problems for matrix-exponential Lévy processes

In this paper, we consider the optimal stopping problems for a general class of reward functions under jump-diffusion processes. Given an American call-type reward function, following the averageing problem approach(see, for example, Alili and Kyprianou [1], Kyprianou and Surya [8], Novikov and Shiryaev [13], and Surya [15] ), we give an explicit formula for solutions of the corresponding avera...

متن کامل

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Finance and Stochastics

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2012